Coded Caching in the Presence of a Wire and a Cache Tapping Adversary of Type II

This paper introduces the notion of cache-tapping into information theoretic models coded caching. The wiretap channel II in presence multiple receivers equipped with fixed-size cache memories, and an adversary which selects symbols to tap from placement and/or delivery is introduced. legitimate terminals know neither whether placement, delivery, or both are tapped, nor positions they tapped. Only size overall tapped set known. For two files, strong secrecy capacity- maximum achievable file rate while keeping library strongly secure- identified. Lower upper bounds on derived when has more than files. Achievability relies a code design combines coding, security embedding codes, one-time pad keys, A genie-aided bound, transmitter provided user demands before establishes converse for two-files case. bound constructed by three successive transformations. Our results establish provable guarantees against powerful optimizes its tapping over phases communication cache-aided system.